Long-distance mutual exclusion for planning
نویسندگان
چکیده
Article history: Received 1 December 2007 Received in revised form 11 November 2008 Accepted 14 November 2008
منابع مشابه
Long-Distance Mutual Exclusion for Propositional Planning
The use of mutual exclusion (mutex) has led to significant advances in propositional planning. However, previous mutex can only detect pairs of actions or facts that cannot be arranged at the same time step. In this paper, we introduce a new class of constraints that significantly generalizes mutex and can be efficiently computed. The proposed long-distance mutual exclusion (londex) can capture...
متن کاملConstraint Propagation in Propositional Planning
Planning as Satisfiability is a most successful approach to optimal propositional planning. It draws its strength from the efficiency of state-of-the-art propositional satisfiability solvers, combined with the utilization of constraints that are inferred from the problem planning graph. One of the recent improvements of the framework is the addition of long-distance mutual exclusion (londex) co...
متن کاملIJCAI - 99 1 Temporal Planning with Mutual Exclusion Reasoning
Many planning domains require a richer notion of time in which actions can overlap and have di erent durations. The key to fast performance in classical planners (e.g., Graphplan, ipp, and Blackbox) has been the use of a disjunctive representation with powerful mutual exclusion reasoning. This paper presents tgp, a new algorithm for temporal planning. tgp operates by incrementally expanding a c...
متن کاملTemporal Planning with Mutual Exclusion Reasoning
Many planning domains require a richer notion of time in which actions can overlap and have di erent durations. The key to fast performance in classical planners (e.g., Graphplan, ipp, and Blackbox) has been the use of a disjunctive representation with powerful mutual exclusion reasoning. This paper presents tgp, a new algorithm for temporal planning. tgp operates by incrementally expanding a c...
متن کاملAn Improved Token-Based and Starvation Free Distributed Mutual Exclusion Algorithm
Distributed mutual exclusion is a fundamental problem of distributed systems that coordinates the access to critical shared resources. It concerns with how the various distributed processes access to the shared resources in a mutually exclusive manner. This paper presents fully distributed improved token based mutual exclusion algorithm for distributed system. In this algorithm, a process which...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Artif. Intell.
دوره 173 شماره
صفحات -
تاریخ انتشار 2009